Task assignment algorithms for two-type heterogeneous multiprocessors
نویسندگان
چکیده
منابع مشابه
Static Heuristic Processor Assignment in Heterogeneous Multiprocessors
It has been already demonstrated that cost-eeective multiprocessor designs may be obtained by combining in the same architecture processors of diierent speeds (heterogeneous architecture) so that the serial and critical portions of the application may beneet from a fast single processor. In such an environment, the problem of assigning tasks to processors becomes a very important one. This pape...
متن کاملHybrid Metaheuristic Algorithm for Real Time Task Assignment Problem in Heterogeneous Multiprocessors
The assignments of real time tasks to heterogeneous multiprocessors in real time applications are very difficult in scenarios that require high performance. The main problem in the heterogeneous multiprocessor system is task assignment to the processors because the execution time for each task varies from one processor to another. Hence, the problem of finding a solution for task assignment to ...
متن کاملBandit-Based Task Assignment for Heterogeneous Crowdsourcing
We consider a task assignment problem in crowdsourcing, which is aimed at collecting as many reliable labels as possible within a limited budget. A challenge in this scenario is how to cope with the diversity of tasks and the task-dependent reliability of workers; for example, a worker may be good at recognizing the names of sports teams but not be familiar with cosmetics brands. We refer to th...
متن کاملOn the Task Assignment Problem: Two New Efficient Heuristic Algorithms
We study the problem of task allocation in heterogeneous distributed systems. The objective is the minimization of the sum of processor execution and intertask communication costs. We transform the problem to a maximization one, where we try to determine and avoid large communication costs and inefficient allocations. After an appropriate graph transformation, we propose two fast algorithms, th...
متن کاملExact Algorithms for a Task Assignment Problem
We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A search. We report simulation results over a wide range of parameters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2013
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-013-9191-3